Exploiting Interaction with Environment to Solve Some of Hard Classication Problems and Its Experimental Demonstration
نویسندگان
چکیده
Conventional Arti cial Intelligence and cognitive science have been argueing the emergence of intelligence by completely separating the system from its environment. In this paper, we will intensively investigate and analyze the role of the system-environment interaction through the comparison between the information processing and embodied cognitive approaches. By taking account of this interaction, we will experimentally show some of the hard classi cation problem su ering from the large input space and the ambiguities due to the perceptual aliasing problem can be greately simpli ed. To demonstrate this concept, we will apply to a garbage-collecting robot as a practical example. %-!<%o!<%I!’<+N’0\F0%m%\%C%H!$<1JL!$4D6-$H$NAj8_:nMQ (automonous mobile robot, distiction, classi cation, interaction with environment) 1 $O$8$a$K <+N’0\F0%m%\%C%H$K$H$C$F!$<1JL$OM?$($i$l$?%?%9 %/$ro$K:$Fq$JLdBj$H$J$k!% $3$l$^$G$N8EE5E*$J?M9)CNG=!JAI!K$dG’CN2J3X$NJ, Ln$K$*$$$F$O!$<1JLLdBj$O%7%s%\%kA‘:n$d9bGE@$,CV$+$l$F$-$?!%$3$NMM$J]%f%K%C%H$X$N%^%C%T%s%0 $K$h$C$F%b%G%k2=$5$l$k!%K\O@J8$G$O!$$3$N%"%W%m!< %A$r>pJs=hM}E*%"%W%m!<%A!J information prosessing approach!K$H8F$V$3$H$K$9$k!%$3$Ne$G!$CNG= $NAOH/$r9M$($F$$$k!%$7$+$7$J$,$i!$%m%\%C%H$O%3%s %H%m!<%i$@$1$G$J$/!$%"%/%A%e%(!<%?$dJ*M}E*$Jo$K4JC12=$5$l$k$3$H$r<($7 $? [2][3]!%H‘$i$O!$?HBN@-$d%7%9%F%‘$H4D6-$H$NAj8_ :nMQ$O$I$A$i$b!$CNG=$NH/8=$K=EMW$JF/$-$r$9$k$3$H $ro$K:$Fq$J$?$a!$L@3N$+$D8z2LE*$JCNG=$N9=C[K! $O8=CJ3,$G$OB8:_$7$F$$$J$$!% $3$NLdBj$r2r$/0l$D$NM-NO$J2A4X ?t$N@_7WK!Ey$K!$0MA3LdBjE@$,B8:_$9$k$b$N$N!$$3$N %"%W%m!<%A$K$h$C$F!$G’CN.$5$J1_Cl!K$rJI$r6hJL $9$kpJs=hM}E*l9g!$IOe5-$N $h$&$J7k2L$,F@$i$l$?$N$+$N9M;!$O9T$J$C$F$$$J$$!% $=$3$G!$K\8&5f$G$O!$$"$$$^$$@-$,K\e=R$N9M;!$K$*$$$F$O!$ action $H behavior $H$$$&35G0$rJ,N%$7$F9M$($kI,MW @-$,$"$k$3$H$r<($9!%$5$i$K!$K\Z $ $k$?$a!$%4%_<}=8%m%\%C%HLdBj$X$N1~MQ$bJ;$;$F;n $_ k!% 2 7B 5cm $N1_Cl!K$H!$$=$l0J30 $NJ*BN!JD>7B 4cm $N1_Cl!$JI!K$N<1JL$re$2$k!% K\8&5f$G$OGE@$rCV $$$F$$$k$?$a!$7B 55mm!$9b$5$O 30mm $N 1_Cl9=B$$rM-$7$F$$$k!%$^$?!$8!CNHO0O$, 0mm $+$i 30mm $^$G$N!$8 $D$N@V30@~6a@\%;%s%5!J6 $D$OA0B&!$ ;D$j$O8e$mB&!K$,Hw$(IU$1$i$l$F$*$j!$$3$l$i$N%;%s %5$O8!CN5wN%$K1~$8$F!$0 $+$i 1023 $^$G$N@0?tCM$r JV$9!%$^$?!$D>N.%b!<%?$GFHN)$K6nF0$5$l$k:81& 2 $D $N$l$N>l=j$K!$J*BN !JBg!?>.1_Cl$b$7$/$O!$JI!K$rCV$-!$IR %;%s%5$NCM$r 5-O?$9$k!%@:EY$r>e$2$k$?$a$K!$$=$l$>$l$N>l=j$G!$ $=$l$>$l$NJ*BN$KBP$7 30 2sB,Dj$r$7$F!$J?6QCM$HI8 =‘JP:9$r5a$a$?!%8e$K9T$J$&%7%_%e%l!<%7%g%s$G$N%; %s%5$NCM$O!$$3$NJ?6QCM$HI8=‘JP:9$r4p$K:n$i$l$k!% Figure 1: Experimental setup for the collection of
منابع مشابه
Genetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure
A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملOn the crack propagation modeling of hydraulic fracturing by a hybridized displacement discontinuity/boundary collocation method
Numerical methods such as boundary element and finite element methods are widely used for the stress analysis in solid mechanics. This study presents boundary element method based on the displacement discontinuity formulation to solve general problems of interaction between hydraulic fracturing and discontinuities. The crack tip element and a higher order boundary displacement collocation techn...
متن کاملIntroducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems
The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...
متن کاملتوسعه مدل مکان یابی-تخصیص حداکثر پوشش با امکان ایجاد ازدحام در محیط رقابتی مبتنی بر انتخاب مشتری
The main objective of facilities location and service system design is covering of potential customers’ demand. Many location models are extended with the covering objective and considered constraints, details of problem and its different aspects. In this paper the maximal covering location-allocation model for congested system is extended in the competitive environment. In the proposed model, ...
متن کامل